A new core-based morphing algorithm for polygons

Morphing is a process of shape transformation between two objects. This paper focuses on morphing of simple polygons. In general, the key part of most morphing methods is to find correspondence between vertices of both objects. We present a new algorithm trying to avoid this step. Using an idea of intersection of two polygons (called core) the problem of morphing polygons is decomposed to several sub-problems of morphing polylines. We describe a solution of morphing problem for the case when the core consists of one polygon. The proposed solution of morphing two polylines does not bring results smooth enough for all polygons, but it has satisfying results for polygons of spiral type which are usually problematic for correspondence based approaches. The algorithm is designed in a way keeping the doors open for other methods of morphing two polylines.